Definability of Truth in Probabilistic Logic (Early draft)

نویسندگان

  • Paul Christiano
  • Eliezer Yudkowsky
  • Marcello Herreshoff
  • Mihaly Barasz
چکیده

The first and most popular is to work with meta-languages. For any language L we may form a new language by adding a predicate True, which acts only on sentences of L (i.e., sentences without the symbol True) and satisfies property 1. We can iterate this construction to obtain an infinite sequence of languages L1, L2, . . ., each of which contains the preceding language’s truth predicate. ∗UC Berkeley. Email: [email protected] †Machine Intelligence Research Institute ‡Google §Google

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

On propositional definability

In standard propositional logic, logical definability is the ability to derive the truth value of some propositional symbols given a propositional formula and the truth values of some propositional symbols. Although appearing more or less informally in various AI settings, a computation-oriented investigation of the notion is still lacking, and this paper aims at filling the gap. After recallin...

متن کامل

Implicit definability of truth constants in Łukasiewicz logic

In the framework of propositional Lukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly defining each of the rational elements in the standard semantics are explored, and based on that, a faithful interpretation of theories in Rational Pavelka logic ...

متن کامل

Two Forms of Dependence in Propositional Logic: Controllability and Definability

We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula if there is a way to fix the truth value of the variables in X in order to achieve to have a prescribed truth value) and definability (X defines a variable y if every truth assignment of the variables inX enables us finding out ...

متن کامل

Probability Logic for Harsanyi Type Spaces

Probability logic has contributed to significant developments in belief types for game-theoretical economics. We present a new probability logic for Harsanyi Type spaces, show its completeness, and prove both a denesting property and a unique extension theorem. We then prove that multi-agent interactive epistemology has greater complexity than its single-agent counterpart by showing that if the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013